package 寻找旋转排序数组中的最小值;

class Solution {
    public int findMin(int[] nums) {
        int left = 0;
        int right = nums.length - 1;
        int target = nums[right];
        while(left < right){
            int mid = left + (right - left) / 2;
            if(nums[mid] > target){
                left = mid + 1;
            }else{
                right = mid;
            }
        }
        return nums[right];
    }
}